Finding cliques by quantum adiabatic evolution
نویسندگان
چکیده
Quantum adiabatic evolution provides a general technique for the solution of combinatorial search problems on quantum computers. We present the results of a numerical study of a particular application of quantum adiabatic evolution, the problem of finding the largest clique in a random graph. An nvertex random graph has each edge included with probability 1 2 , and a clique is a completely connected subgraph. There is no known classical algorithm that finds the largest clique in a random graph with high probability and runs in a time polynomial in n. For the small graphs we are able to investigate (n ≤ 18), the quantum algorithm appears to require only a quadratic run time.
منابع مشابه
Adiabatic quantum search algorithm for structured problems
The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an unstructured search problem with a quadratic speedup over a classical search, just as Grover’s algorithm. In this paper, we study how the structure of the search...
متن کاملSpeedup in Quantum Adiabatic Evolution Algorithm
Quantum adiabatic evolution algorithm suggested by Farhi et al. was effective in solving instances of NP-complete problems. The algorithm is governed by the adiabatic theorem. Therefore, in order to reduce the running time, it is essential to examine the minimum energy gap between the ground level and the next one through the evolution. In this letter, we show a way of speedup in quantum adiaba...
متن کاملEntanglement as a resource in adiabatic quantum optimization
We explore the role of entanglement in adiabatic quantum optimization by performing approximate simulations of the real-time evolution of a quantum system while limiting the amount of entanglement. To classically simulate the time evolution of the system with a limited amount of entanglement, we represent the quantum state using matrix-product states and projected entangledpair states. We show ...
متن کاملQuantum-Merlin-Arthur-complete problems for stoquastic Hamiltonians and Markov matrices
We show that finding the lowest eigenvalue of a 3-local symmetric stochastic matrix is Quantum-MerlinArthur-complete (QMA-complete). We also show that finding the highest energy of a stoquastic Hamiltonian is QMA-complete and that adiabatic quantum computation using certain excited states of a stoquastic Hamiltonian is universal. We also show that adiabatic evolution in the ground state of a st...
متن کاملOn The Power Of Coherently Controlled Quantum Adiabatic Evolutions
A major challenge facing adiabatic quantum computing is that algorithm design and error correction can be difficult for adiabatic quantum computing. Recent work has considered addressing this challenge by using coherently controlled adiabatic evolutions in the place of classically controlled evolution. An important question remains: what is the relative power of controlled adiabatic evolution t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Quantum Information & Computation
دوره 2 شماره
صفحات -
تاریخ انتشار 2002